Real Polynomial Chebyshev Approximation by the Carathiodory - Fejir Method

نویسنده

  • N. TREFETHEN
چکیده

A new method is presented for near-best approximation of a real function F on [-r, r] by a polynomial of degree m. The method is derived by transplanting the given problem to the unit disk, then applying the Carath6odory-Fej6r theorem. The resulting near-best approximation is constructed from the principal eigenvalue and eigenvector of a Hankel matrix of Chebyshev coefficients of F. It is well known that as-0, the mth partial sum of the Chebyshev series of F agrees with the best approximation to a relative error O('r). In contrast, our approximation is shown to differ from best by at most O(7"2m+3). m similar result is given for approximation on [-1, 1] as m oe. Such high-order agreement is of both practical and theoretical importance. In particular, it establishes a real analogue of the phenomenon that on the complex unit disk best approximation error curves tend to closely approximate circles. Several numerical examples are presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Differential Equations by Using a Combination of the First Kind Chebyshev Polynomials and Adomian Decomposition Method

In this paper, we are going to solve a class of ordinary differential equations that its source term are rational functions. We obtain the best approximation of source term by Chebyshev polynomials of the first kind, then we solve the ordinary differential equations by using the Adomian decomposition method

متن کامل

The best uniform polynomial approximation of two classes of rational functions

In this paper we obtain the explicit form of the best uniform polynomial approximations out of Pn of two classes of rational functions using properties of Chebyshev polynomials. In this way we present some new theorems and lemmas. Some examples will be given to support the results.

متن کامل

Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding

Robust polynomial rootfinders can be exploited to compute the roots on a real interval of a nonpolynomial function f(x) by the following: (i) expand f as a Chebyshev polynomial series, (ii) convert to a polynomial in ordinary, series-of-powers form, and (iii) apply the polynomial rootfinder. (Complex-valued roots and real roots outside the target interval are discarded.) The expansion is most e...

متن کامل

Computable Function Representations Using Effective Chebyshev Polynomial

We show that Chebyshev Polynomials are a practical representation of computable functions on the computable reals. The paper presents error estimates for common operations and demonstrates that Chebyshev Polynomial methods would be more efficient than Taylor Series methods for evaluation of transcendental functions. Keywords—Approximation Theory, Chebyshev Polynomial, Computable Functions, Comp...

متن کامل

Chebyshev polynomial Kalman filter

A novel Gaussian state estimator named Chebyshev Polynomial Kalman Filter is proposed that exploits the exact and closed-form calculation of posterior moments for polynomial nonlinearities. An arbitrary nonlinear system is at first approximated via a Chebyshev polynomial series. By exploiting special properties of the Chebyshev polynomials, exact expressions for mean and variance are then provi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1982